Operation of a multi-slice processor implementing a load/store unit maintaining rejected instructions

ABSTRACT

Operation of a multi-slice processor that includes a plurality of execution slices, a plurality of load/store slices, and one or more instruction sequencing units, where operation includes: receiving, at a load/store slice from an instruction sequencing unit, a instruction to be issued; determining, at the load/store slice, a rejection condition for the instruction; and responsive to determining the rejection condition for the instruction, maintaining state information for the instruction in the load/store slice instead of notifying the instruction sequencing unit of a rejection of the instruction.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of and claims priorityfrom U.S. patent application Ser. No. 15/221,035, filed Jul. 27, 2016,which is a continuation application of and claims priority from U.S.patent application Ser. No. 15/152,257, filed May 11, 2016.

BACKGROUND Field of the Invention

The field of the invention is data processing, or, more specifically,methods and apparatus for operation of a multi-slice processor.

Description of Related Art

The development of the EDVAC computer system of 1948 is often cited asthe beginning of the computer era. Since that time, computer systemshave evolved into extremely complicated devices. Today's computers aremuch more sophisticated than early systems such as the EDVAC. Computersystems typically include a combination of hardware and softwarecomponents, application programs, operating systems, processors, buses,memory, input/output devices, and so on. As advances in semiconductorprocessing and computer architecture push the performance of thecomputer higher and higher, more sophisticated computer software hasevolved to take advantage of the higher performance of the hardware,resulting in computer systems today that are much more powerful thanjust a few years ago.

One area of computer system technology that has advanced is computerprocessors. As the number of computer systems in data centers and thenumber of mobile computing devices has increased, the need for moreefficient computer processors has also increased. Speed of operation andpower consumption are just two areas of computer processor technologythat affect efficiency of computer processors.

SUMMARY

Methods and apparatus for operation of a multi-slice processor aredisclosed in this specification. Such a multi-slice processor includes aplurality of execution slices and a plurality of load/store slices,where the load/store slices are coupled to the execution slices via aresults bus. Such a multi-slice processor may further include one ormore instruction sequencing units. Operation of such a multi-sliceprocessor includes: receiving, at a load/store slice from an instructionsequencing unit, a instruction to be issued; determining, at theload/store slice, a rejection condition for the instruction; andresponsive to determining the rejection condition for the instruction,maintaining state information for the instruction in the load/storeslice instead of notifying the instruction sequencing unit of arejection of the instruction.

The foregoing and other objects, features and advantages of theinvention will be apparent from the following more particulardescriptions of exemplary embodiments of the invention as illustrated inthe accompanying drawings wherein like reference numbers generallyrepresent like parts of exemplary embodiments of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 sets forth a block diagram of an example system configured foroperation of a multi-slice processor according to embodiments of thepresent invention.

FIG. 2 sets forth a block diagram of a portion of a multi-sliceprocessor according to embodiments of the present invention.

FIG. 3 sets forth a block diagram of a portion of a load/store slice ofa multi-slice processor, where the load/store slice implementsmaintaining rejected instructions according to different embodiments.

FIG. 4 sets forth a flow chart illustrating an exemplary method ofoperation of a multi-slice processor, where the load/store sliceimplements maintaining rejected instructions according to differentembodiments.

FIG. 5 sets forth a flow chart illustrating an exemplary method ofoperation of a multi-slice processor in which a load/store slice isconfigured to implements maintaining rejected instructions according todifferent embodiments.

FIG. 6 sets forth a flow chart illustrating an exemplary method ofoperation of a multi-slice processor in which a load/store slice isconfigured to implements maintaining rejected instructions according todifferent embodiments.

DETAILED DESCRIPTION

Exemplary methods and apparatus for operation of a multi-slice processorin accordance with the present invention are described with reference tothe accompanying drawings, beginning with FIG. 1. FIG. 1 sets forth ablock diagram of an example system configured for operation of amulti-slice processor according to embodiments of the present invention.The system of FIG. 1 includes an example of automated computingmachinery in the form of a computer (152).

The computer (152) of FIG. 1 includes at least one computer processor(156) or ‘CPU’ as well as random access memory (168) (‘RAM’) which isconnected through a high speed memory bus (166) and bus adapter (158) toprocessor (156) and to other components of the computer (152).

The example computer processor (156) of FIG. 1 may be implemented as amulti-slice processor. The term ‘multi-slice’ as used in thisspecification refers to a processor having a plurality of similar oridentical sets of components, where each set may operate independentlyof all the other sets or in concert with the one or more of the othersets. The multi-slice processor (156) of FIG. 1, for example, includesseveral execution slices (‘ES’) and several load/store slices(‘LSS’)—where load/store slices may generally be referred to asload/store units. Each execution slice may be configured to providecomponents that support execution of instructions: an issue queue,general purpose registers, a history buffer, an arithmetic logic unit(including a vector scalar unit, a floating point unit, and others), andthe like. Each of the load/store slices may be configured withcomponents that support data movement operations such as loading of datafrom cache or memory or storing data in cache or memory. In someembodiments, each of the load/store slices includes a data cache. Theload/store slices are coupled to the execution slices through a resultsbus. In some embodiments, each execution slice may be associated with asingle load/store slice to form a single processor slice. In someembodiments, multiple processor slices may be configured to operatetogether.

The example multi-slice processor (156) of FIG. 1 may also include, inaddition to the execution and load/store slices, other processorcomponents. In the system of FIG. 1, the multi-slice processor (156)includes fetch logic, dispatch logic, and branch prediction logic.Further, although in some embodiments each load/store slice includescache memory, the multi-slice processor (156) may also include cacheaccessible by any or all of the processor slices.

Although the multi-slice processor (156) in the example of FIG. 1 isshown to be coupled to RAM (168) through a front side bus (162), a busadapter (158) and a high speed memory bus (166), readers of skill in theart will recognize that such configuration is only an exampleimplementation. In fact, the multi-slice processor (156) may be coupledto other components of a computer system in a variety of configurations.For example, the multi-slice processor (156) in some embodiments mayinclude a memory controller configured for direct coupling to a memorybus (166). In some embodiments, the multi-slice processor (156) maysupport direct peripheral connections, such as PCIe connections and thelike.

Stored in RAM (168) in the example computer (152) is a data processingapplication (102), a module of computer program instructions that whenexecuted by the multi-slice processor (156) may provide any number ofdata processing tasks. Examples of such data processing applications mayinclude a word processing application, a spreadsheet application, adatabase management application, a media library application, a webserver application, and so on as will occur to readers of skill in theart. Also stored in RAM (168) is an operating system (154). Operatingsystems useful in computers configured for operation of a multi-sliceprocessor according to embodiments of the present invention includeUNIX™, Linux™, Microsoft Windows™, AIX™, IBM's z/OS™, and others as willoccur to those of skill in the art. The operating system (154) and dataprocessing application (102) in the example of FIG. 1 are shown in RAM(168), but many components of such software typically are stored innon-volatile memory also, such as, for example, on a disk drive (170).

The computer (152) of FIG. 1 includes disk drive adapter (172) coupledthrough expansion bus (160) and bus adapter (158) to processor (156) andother components of the computer (152). Disk drive adapter (172)connects non-volatile data storage to the computer (152) in the form ofdisk drive (170). Disk drive adapters useful in computers configured foroperation of a multi-slice processor according to embodiments of thepresent invention include Integrated Drive Electronics (‘IDE’) adapters,Small Computer System Interface (‘SCSI’) adapters, and others as willoccur to those of skill in the art. Non-volatile computer memory alsomay be implemented for as an optical disk drive, electrically erasableprogrammable read-only memory (so-called ‘EEPROM’ or ‘Flash’ memory),RAM drives, and so on, as will occur to those of skill in the art.

The example computer (152) of FIG. 1 includes one or more input/output(‘I/O’) adapters (178). I/O adapters implement user-orientedinput/output through, for example, software drivers and computerhardware for controlling output to display devices such as computerdisplay screens, as well as user input from user input devices (181)such as keyboards and mice. The example computer (152) of FIG. 1includes a video adapter (209), which is an example of an I/O adapterspecially designed for graphic output to a display device (180) such asa display screen or computer monitor. Video adapter (209) is connectedto processor (156) through a high speed video bus (164), bus adapter(158), and the front side bus (162), which is also a high speed bus.

The exemplary computer (152) of FIG. 1 includes a communications adapter(167) for data communications with other computers (182) and for datacommunications with a data communications network (100). Such datacommunications may be carried out serially through RS-232 connections,through external buses such as a Universal Serial Bus (‘USB’), throughdata communications networks such as IP data communications networks,and in other ways as will occur to those of skill in the art.Communications adapters implement the hardware level of datacommunications through which one computer sends data communications toanother computer, directly or through a data communications network.Examples of communications adapters useful in computers configured foroperation of a multi-slice processor according to embodiments of thepresent invention include modems for wired dial-up communications,Ethernet (IEEE 802.3) adapters for wired data communications, and 802.11adapters for wireless data communications.

The arrangement of computers and other devices making up the exemplarysystem illustrated in FIG. 1 are for explanation, not for limitation.Data processing systems useful according to various embodiments of thepresent invention may include additional servers, routers, otherdevices, and peer-to-peer architectures, not shown in FIG. 1, as willoccur to those of skill in the art. Networks in such data processingsystems may support many data communications protocols, including forexample TCP (Transmission Control Protocol), IP (Internet Protocol),HTTP (HyperText Transfer Protocol), WAP (Wireless Access Protocol), HDTP(Handheld Device Transport Protocol), and others as will occur to thoseof skill in the art. Various embodiments of the present invention may beimplemented on a variety of hardware platforms in addition to thoseillustrated in FIG. 1.

For further explanation, FIG. 2 sets forth a block diagram of a portionof a multi-slice processor according to embodiments of the presentinvention. The multi-slice processor in the example of FIG. 2 includes adispatch network (202). The dispatch network (202) includes logicconfigured to dispatch instructions for execution among executionslices.

The multi-slice processor in the example of FIG. 2 also includes anumber of execution slices (204 a, 204 b-204 n). Each execution sliceincludes general purpose registers (206) and a history buffer (208). Thegeneral purpose registers and history buffer may sometimes be referredto as the mapping facility, as the registers are utilized for registerrenaming and support logical registers.

The general purpose registers (206) are configured to store the youngestinstruction targeting a particular logical register and the result ofthe execution of the instruction. A logical register is an abstractionof a physical register that enables out-of-order execution ofinstructions that target the same physical register.

When a younger instruction targeting the same particular logicalregister is received, the entry in the general purpose register is movedto the history buffer, and the entry in the general purpose register isreplaced by the younger instruction. The history buffer (208) may beconfigured to store many instructions targeting the same logicalregister. That is, the general purpose register is generally configuredto store a single, youngest instruction for each logical register whilethe history buffer may store many, non-youngest instructions for eachlogical register.

Each execution slice (204) of the multi-slice processor of FIG. 2 alsoincludes an execution reservation station (210). The executionreservation station (210) may be configured to issue instructions forexecution. The execution reservation station (210) may include an issuequeue. The issue queue may include an entry for each operand of aninstruction. The execution reservation station may issue the operandsfor execution by an arithmetic logic unit or to a load/store slice (222a, 222 b, 222 c) via the results bus (220).

The arithmetic logic unit (212) depicted in the example of FIG. 2 may becomposed of many components, such as add logic, multiply logic, floatingpoint units, vector/scalar units, and so on. Once an arithmetic logicunit executes an operand, the result of the execution may be stored inthe result buffer (214) or provided on the results bus (220) through amultiplexer (216).

The results bus (220) may be configured in a variety of manners and beof composed in a variety of sizes. In some instances, each executionslice may be configured to provide results on a single bus line of theresults bus (220). In a similar manner, each load/store slice may beconfigured to provide results on a single bus line of the results bus(220). In such a configuration, a multi-slice processor with fourprocessor slices may have a results bus with eight bus lines—four buslines assigned to each of the four load/store slices and four bus linesassigned to each of the four execution slices. Each of the executionslices may be configured to snoop results on any of the bus lines of theresults bus. In some embodiments, any instruction may be dispatched to aparticular execution unit and then by issued to any other slice forperformance. As such, any of the execution slices may be coupled to allof the bus lines to receive results from any other slice. Further, eachload/store slice may be coupled to each bus line in order to receive anissue load/store instruction from any of the execution slices. Readersof skill in the art will recognize that many different configurations ofthe results bus may be implemented.

The multi-slice processor in the example of FIG. 2 also includes anumber of load/store slices (222 a, 222 b-222 n). Each load/store sliceincludes a queue (224), a multiplexer (228), a data cache (232), andformatting logic (226), among other components described below withregard to FIG. 3. The queue receives load and store operations to becarried out by the load/store slice (222). The formatting logic (226)formats data into a form that may be returned on the results bus (220)to an execution slice as a result of a load or store instruction.

The example multi-slice processor of FIG. 2 may be configured for flushand recovery operations. A flush and recovery operation is an operationin which the registers (general purpose register and history buffer) ofthe multi-slice processor are effectively ‘rolled back’ to a previousstate. The term ‘restore’ and ‘recover’ may be used, as context requiresin this specification, as synonyms. Flush and recovery operations may becarried out for many reasons, including missed branch predictions,exceptions, and the like. Consider, as an example of a typical flush andrecovery operation, that a dispatcher of the multi-slice processordispatches over time and in the following order: an instruction Atargeting logical register 5, an instruction B targeting logicalregister 5, and an instruction C targeting logical register 5. At thetime instruction A is dispatched, the instruction parameters are storedin the general purpose register entry for logical register 5. Then, wheninstruction B is dispatched, instruction A is evicted to the historybuffer (all instruction parameters are copied to the history buffer,including the logical register and the identification of instruction Bas the evictor of instruction A), and the parameters of instruction Bare stored in the general purpose register entry for logical register 5.When instruction C is dispatched, instruction B is evicted to thehistory buffer and the parameters of instruction C are stored in thegeneral purpose register entry for logical register 5. Consider, now,that a flush and recovery operation of the registers is issued in whichthe dispatch issues a flush identifier matching the identifier ofinstruction C. In such an example, flush and recovery includesdiscarding the parameters of instruction C in the general purposeregister entry for logical register 5 and moving the parameters ofinstruction B from the history buffer for instruction B back into theentry of general purpose register for logical register 5.

During the flush and recovery operation, in prior art processors, thedispatcher was configured to halt dispatch of new instructions to anexecution slice. Such instructions may be considered either target orsource instructions. A target instruction is an instruction that targetsa logical register for storage of result data. A source instruction bycontrast has, as its source, a logical register. A target instruction,when executed, will result in data stored in an entry of a register filewhile a source instruction utilizes such data as a source for executingthe instruction. A source instruction, while utilizing one logicalregister as its source, may also target another logical register forstorage of the results of instruction. That is, with respect to onelogical register, an instruction may be considered a source instructionand with respect to another logical register, the same instruction maybe considered a target instruction.

The multi-slice processor in the example of FIG. 2 also includes aninstruction sequencing unit (240). While depicted as a single unit, eachof the plurality of execution slices may include a respectiveinstruction sequencing unit similar to instruction sequencing unit(240). Instruction sequencing unit (240) may take dispatchedinstructions and check dependencies of the instructions to determinewhether all older instructions with respect to a current instructionhave delivered, or may predictably soon deliver, results of these olderinstructions from which the current instruction is dependent so that thecurrent instruction may execute correctly. If all dependencies to acurrent instruction are satisfied, then a current instruction may bedetermined to be ready to issue, and may consequently beissued—regardless of a program order of instructions as determined by anITAG. Such issuance of instructions may be referred to as an“out-of-order” execution, and the multi-slice processor may beconsidered an out-of-order machine.

In some cases, a load/store unit receiving an issued instruction, suchas a load/store slice, may not yet be able to handle the instruction,and the instruction sequencing unit (240) may keep the instructionqueued until such time as the load/store slice may handle theinstruction. After the instruction is issued, the instruction sequencingunit (240) may track progress of the instruction based at least in parton signals received from a load/store slice.

For further explanation, FIG. 3 sets forth a block diagram depicting anexpanded view of a load/store slice (222 a) implementing architecturalcomponents that include a load/store access queue (LSAQ) (224), a loadreorder queue (LRQ) (304), a load miss queue (LMQ) (308), a storereorder queue (SRQ) (306), a data cache (232), among other components.

In previous systems, if a load/store unit received an instruction froman instruction sequencing unit, and the load/store unit was unable tohandle the instruction for some reason, then the load/store unit wouldnotify the instruction sequencing unit that the instruction was beingrejected and the load/store unit would discard information related tothe rejected instruction. In which case, the instruction sequencing unitwould continue maintaining information to track and maintain therejected instruction until the instruction is resent to the load/storeunit. An instruction may be rejected for a variety of reasons, includingan address miss in an address translation cache, a set prediction miss,data cache banking collisions, an overload of the load miss queue (308),among other possible rejection conditions.

The load/store slice (222 a), by contrast to the above previous system,is configured to determine a rejection condition for an instructionreceived from an instruction sequencing unit, however, the load/storeslice (222 a), instead of sending a reject signal to the instructionsequencing unit, maintains tracking and handling of theinstruction—including information usable to relaunch or reissue theinstruction—until the rejection condition is resolved. Further, an entryin the load reorder queue (304) or the store reorder queue (306) may beconfigured to maintain information for tracking an instruction thatwould otherwise have been rejected and removed from the load reorderqueue (304). For example, if the load/store slice (222 a) determinesthat a rejection condition exists for a given load or store instruction,then logic within the load/store slice may notify the load reorder queue(304) or the store reorder queue (306) to place the instruction in asleep state for a given number of cycles, or to place the instruction ina sleep state until notified to awaken, or to immediately reissue theinstruction, among other notifications to perform other operations.

In this way, the load/store slice (222 a) may save cycles that wouldotherwise be lost if the instruction were rejected to the instructionsequencing unit because the load/store slice (222 a) may moreefficiently and quickly reissue the instruction when the rejectioncondition is resolved in addition to more quickly detecting resolutionof a rejection condition than an instruction sequencing unit. Forexample, if the load/store slice (222 a) determines that an instructionthat is in a sleep state may be reissued in response to determining thatone or more rejection conditions have been resolved preventing theinstruction from completing, then the load/store store slice may notifythe load reorder queue (304) or the store reorder queue (306) torelaunch or reissue the instruction immediately or after some number ofcycles. The number of cycles may depend upon a type of rejectioncondition or upon other factors affecting reissue or relaunch of theinstruction. In this example, the load reorder queue (304) or the storereorder queue (306) may reissue or relaunch an instruction by providingthe load/store access queue (224) with information to reissue theinstruction, where the load reorder queue (304) or the store reorderqueue (306) may communicate with the load/store access queue (224) alongline (314) and may provide data for reissuing or relaunching theinstruction along line (313).

Another improvement that results from the load/store slice (222 a)maintaining an instruction if a rejection condition is determined isthat the load/store slice (222 a) uses fewer resources, such as logicand circuitry for latches and other components, to maintain theinstruction than an instruction sequencing unit. In other words, giventhat the instruction sequencing unit may rely on the load/store slice(222 a) in handling the instruction to completion, the instructionsequencing unit may free resources once the instruction is provided tothe load/store slice (222 a).

Further, the instruction sequencing unit (240), based at least in parton communications with the load/store slice (222 a), may determine whenand whether to wake instructions that may be dependent on a currentinstruction being handled by the load/store slice (222 a). Therefore, ifthe load/store slice (222 a) determines that a rejection conditionexists, the load/store slice (222 a) delays a notification to theinstruction sequencing unit (240) to awaken dependent instructions toprevent the instruction sequencing unit (240) from issuing dependentinstructions that are subsequently unable to finish due to lack ofavailability of results from a current instruction. In this way, theinstruction sequencing unit (240) may avoid wasting execution cyclesreissuing dependent instructions that are unable to finish.

For example, the load/store slice (222 a) may communicate with theinstruction sequencing unit (240) through the generation of signalsindicating, at different points in handling a load instruction, that aload instruction is to be reissued or that data for a load instructionis valid. In some cases, in response to the instruction sequencing unit(240) receiving a signal from the load/store slice (222 a) that a giveninstruction is to be reissued, the instruction sequencing unit (240) mayawaken instructions dependent upon the given instruction with theexpectation that the given instruction, after being reissued, is goingto finish and provide valid data.

The load/store slice (222 a) may also retrieve data from any tier of amemory hierarchy, beginning with a local data cache (232), and extendingas far down in the hierarchy as needed to find requested data. Therequested data, when received, may be provided to general purposeregisters, virtual registers, or to some other destination. The receiveddata may also be stored in a data cache (232) for subsequent access. Theload/store slice (222 a) may also manage translations of effectiveaddresses to real addresses to communicate with different levels ofmemory hierarchy.

A store reorder queue (306) may include entries for tracking the cacheoperations for sequential consistency and may reissue operations intothe load/store pipeline for execution independent of an execution slice.

A load miss queue (308) may issue requests for data to one or more datastorage devices of a multi-tiered memory hierarchy, where a request fordata may correspond to a load instruction for the data.

Responsive to the data being returned along the line (302) to theload/store slice (222 a), the data may be delivered to a destinationsuch as the results bus (220 of FIG. 2) to be loaded into, for example,a general purpose register—where the delivery of the data may be fromthe data cache (232) or over the line (310). The line (310) bypasses thedata cache (232) and allows implementation of a critical data forwardingpath. The load reorder queue (304) may also use line (312) to notify aninstruction sequencing unit, or some other logical component, that thedata is available.

A load reorder queue (304) may track execution of cache operationsissued to the load/store slice (222 a) and includes entries for trackingcache operations for sequential consistency, among other attributes. Theload reorder queue (304) may also reissue operations into the load/storepipeline for execution, which provides operation that is independent ofthe execution slices.

For further explanation, FIG. 4 sets forth a flow chart illustrating anexemplary method of operation of a multi-slice processor implementing aload/store unit configured to maintain rejected instructions. The methodof FIG. 4 may be carried out by a multi-slice processor similar to thatin the examples of FIGS. 1-3. Such a multi-slice processor may includean instruction sequencing unit (240), and a plurality of load/storeslices (220 a-220 n), where each of the load/store slices may implementa load/store access queue (224), a load reorder queue (304), and a storereorder queue (306), as described above with regard to FIG. 3.

The method of FIG. 4 also includes receiving (402), at a load/storeslice (222 a), an instruction (452) to be issued. Receiving (402) theinstruction may be carried out by the load/store slice (222 a) receivinga request for the data at the load/store access queue (224), and movingthe operation through the load/store slice (222 a) pipeline. Theinstruction (452) may be received from the instruction sequencing unit(240), and the instruction (452) may be a load or store instruction.

During normal operation, a load operation may access data already storedin a data cache and the load operation finishes without being reissued.However, under some conditions, the load/store slice (222 a) maydetermine that an instruction is to be reissued or rejected—where aninstruction may be reissued immediately, or after some number of cyclesdependent upon a rejection condition for the instruction being resolved.While it is often the case that a reissued instruction may complete, ifa reissued instruction does not complete, sending a signal to theinstruction sequencing unit (240) may result in instructions dependentupon the reissued instruction being awakened prematurely. Similarly,under some conditions, a store instruction may be unable to beperformed.

The method of FIG. 4 also includes determining (404), at the load/storeslice (224 a), a rejection condition for the instruction (452).Determining (404) a rejection condition for the instruction (452) may becarried out by load/store slice (222 a) determining one or moreconditions that would cause the load/store slice (222 a) to reject theinstruction, including the data cache being unable to currently read arequested data address, a translation mechanism being unable totranslate the requested data address, a load/miss queue being too busyto handle the instruction request, a detected hazard with other load orstore instructions, waiting for a store forward to complete, among otherpossible conditions for rejecting an instruction.

The method of FIG. 4 also includes, responsive to determining, at theload/store slice (222 a), a rejection condition for the instruction,maintaining (406) state information for the instruction in theload/store slice (222 a) instead of notifying an instruction sequencingunit of a rejection of the instruction. Maintaining (406) stateinformation for the instruction in the load/store slice (222 a) may becarried out by logic within the load/store slice (222 a) notifying—inthe case of a load instruction—the load reorder queue (304) to modifystatus for an entry storing state information to indicate a sleep stateor a state that would otherwise idle the instruction. Similarly, in thecase that the instruction is a store instruction, the logic within theload/store slice (222 a) may notify the store reorder queue (306) tomodify status for an entry storing state information to indicate a sleepstate or a state that would otherwise idle the instruction.

Further, maintaining the state information may include storing, forexample, within an entry of the load reorder queue (304) or storereorder queue (306), information that may be used to reissue or relaunchthe instruction after a notification is received to awaken due to arejection condition being resolved, or due to a rejection conditionbeing expected to resolve within a quantity of cycles.

For example, an entry may store, or maintain, information previouslyheld to handle instructions so that a reissued instruction appearsidentical or similar to the instruction as originally received from aninstruction sequencing unit. For example, an entry may store, ormaintain, instruction operation codes, or opcodes, effective addressinformation to determine which bytes in a cacheline are involved in aninstruction, an ITAG, which may be used for ordering instructions, areal address, which may describe a cacheline address used by lower tiersof memory, and various control bits, among other information. Further,the entry may store, or maintain, a set of wait states corresponding todifferent rejection conditions, where this information may be a basisfor awakening instructions in response to corresponding rejectionconditions being resolved.

The load reorder queue (304) and the store reorder queue (306) arefurther configured to, in response to being notified to place aninstruction into a sleep state, not send any signal or notification tothe instruction sequencing unit that provided the instruction to preventthe instruction sequencing unit from prematurely awakening anyinstructions dependent on the instruction being placed into a sleepstate.

For example, in response to the instruction sequencing unit (240)receiving a signal on the results bus (220) indicating that aninstruction is being reissued, the instruction sequencing unit (240) mayawaken instructions dependent on the reissued instruction inanticipation that a data valid signal is to follow, which would allowthe dependent instructions to execute properly. However, if theload/store slice (222 a) delays sending a signal that an instruction isbeing reissued, the instruction sequencing unit (240) does not awakeninstructions dependent upon the reissued instruction, thereby avoidingcancelation of dependent instructions awakened for a reissuedinstruction that does not complete upon reissue, which prevents wastingexecution cycles recovering from canceling the dependent instructions.

In this way, the load/store slice (222 a) relieves the instructionsequencing unit from expending any resources tracking an instructiononce the instruction sequencing unit provides the instruction to theload/store slice (222 a) because the instruction sequencing unit relieson the load/store slice (222 a) to handle the instruction to completionwhether or not the load/store slice (222 a) determines or identifies anyrejection conditions that would have otherwise required the instructionsequencing unit to maintain status information for the instruction.

For further explanation, FIG. 5 sets forth a flow chart illustrating anexemplary method of operation of a multi-slice processor implementing aload/store unit configured to maintain rejected instructions. The methodof FIG. 5 may be carried out by a multi-slice processor similar to thatin the examples of FIGS. 1-3. Such a multi-slice processor may includean instruction sequencing unit (240), and a plurality of load/storeslices (220 a-220 n), where each of the load/store slices may implementa load/store access queue (224), a load reorder queue (304), and a storereorder queue (306), as described above with regard to FIG. 3.

The method of FIG. 5 is similar to the method of FIG. 4 in that themethod of FIG. 5 also includes receiving (402), at a load/store slice(222 a), an instruction (452) to be issued; determining (404), at theload/store slice (224 a), a rejection condition for the instruction(452); and responsive to determining, at the load/store slice (222 a), arejection condition for the instruction, maintaining (406) stateinformation for the instruction in the load/store slice (222 a) insteadof notifying an instruction sequencing unit of a rejection of theinstruction.

The method of FIG. 5 differs from the method of FIG. 4, however, in thatthe method of FIG. 5 further includes: determining (502) that therejection condition for the instruction has resolved or is pendingresolution; responsive to determining that the rejection condition forthe instruction has resolved or is pending resolution, reissuing (504)the instruction from within the load/store slice (222 a) and notifying(506) the instruction sequencing unit that the instruction is beingreissued; determining (508) an arrival of data for the instruction froma lower tier of memory into the data cache (232) on the load/store slice(222 a); and scheduling (510) the instruction to be issued such that theinstruction may provide the data for the instruction to a destinationwithout accessing the data cache (232).

Determining (502) that the rejection condition for the instruction hasresolved or is pending resolution may be carried out by the load/storeslice (222 a) determining that one or more of the conditions on which arejection of the instruction may be based, as determined at (404), hasbeen resolved or is expected to be resolved within some quantity ofcycles. For example, the load/store slice (222 a) may determineresolution of rejection conditions including: the data cache beingunable to currently read a requested data address, a translationmechanism being unable to translate the requested data address, aload/miss queue being too busy to handle the instruction request, adetected hazard with other load or store instructions, waiting for astore forward to complete, among other possible conditions for rejectingan instruction.

The load/store slice (222 a) may further determine, based on a type ofrejection, a quantity of cycles within which a resolution of a rejectioncondition is expected to resolve, and notify the load reorder queue(304) or the store reorder queue (306).

Reissuing (504) the instruction (452) from within the load/store slice(222 a) may be carried out by the load/store slice (222 a) notifyingeither the load reorder queue (304) or the store reorder queue (306) toawaken an instruction previously placed in a sleep state or to awakenafter passage, the lapse of, a quantity of cycles. In response toreceiving a signal to awaken, the load reorder queue (304) or the storereorder queue (306) may signal (552) the load/store access queue (224)along line (314) to reissue or relaunch an instruction.

Further, the load/store slice (222 a) may determine an order in which toawaken multiple instructions that are in a sleep state awaitingresolution of rejection conditions. In other words, while instructionsarrive at the load/store slice (222 a) in an order determined by aninstruction sequencing unit, the load/store slice (222 a) may reorderinstructions such that any effect of the completed, reorderedinstructions, is consistent with the order in which the instructionswere received from the instruction sequencing unit. For example, theload/store slice (222 a) may determine awakening priorities based on atleast in part on an age of an instruction, a measure of nearness tocompletion for the instruction, or according to an instruction that maytake advantage of carry data forwarding.

Notifying (506) the instruction sequencing unit (240) that theinstruction is being reissued may be carried out by the load reorderqueue (304) or the store reorder queue (306) generating a signal (554)notifying the instruction sequencing unit (240) along line (312) to theresults bus (220)—where the signal (554) may indicate to the instructionsequencing unit (240) an identification of a reissue signal, and an ITAGidentifying the instruction being reissued.

Further, the load/store slice (222 a) may propagate a signal to theinstruction sequencing unit (240) indicating that the data requested bythe load instruction, identifiable by an ITAG, is on a results bus andis valid, where the instruction sequencing unit (240) receives thesignal and corresponds the signal with an indication that the data isvalid and on the results bus (220).

Determining (508) an arrival of data for the instruction from a lowertier of memory into the data cache (232) on the load/store slice (222 a)may be carried out by the load/store slice (222 a) receiving anindication from a lower tier of memory that requested data is movingtoward the data cache (232) and may be expected to be available at agiven number of cycles. Such information may allow the load/store slice(222 a) to awaken load instructions in time to make use of a carry dataforward path.

Scheduling (510) the instruction to be issued such that the instructionmay provide the data for the instruction to a destination withoutaccessing the data cache (232) may be carried out by the load/storeslice (222 a) notifying the load reorder queue (304) to awaken asleeping instruction in time so that the instruction may provide thedata being received to a destination along a carry data forward path(310) without waiting for the requested data first being latched orstored in the data cache (232). In other words, the instruction makesuse of the carry data forwarding technique described above with regardto FIG. 3. For example, the load/store slice (222 a) may determine howmany cycles from a current point to wait before sending an awaken signalto the load reorder queue (304) so that when the awakened instructionhas progressed through reissue to make use of the requested data, thedata is available.

In this way, the load/store slice (222 a) may awaken instructions atpoints in time a number of cycles from a current point so that theawakened and reissued instructions are not delayed in completing.

For further explanation, FIG. 6 sets forth a flow chart illustrating anexemplary method of operation of a multi-slice processor implementing aload/store unit configured to maintain rejected instructions. The methodof FIG. 6 may be carried out by a multi-slice processor similar to thatin the examples of FIGS. 1-3. Such a multi-slice processor may includean instruction sequencing unit (240), and a plurality of load/storeslices (220 a-220 n), where each of the load/store slices may implementa load/store access queue (224), a load reorder queue (304), and a storereorder queue (306), as described above with regard to FIG. 3.

The method of FIG. 6 is similar to the method of FIG. 4 in that themethod of FIG. 6 also includes receiving (402), at a load/store slice(222 a), a load instruction (452) to be issued; determining (404), atthe load/store slice (224 a), a rejection condition for the instruction(452); and responsive to determining, at the load/store slice (222 a), arejection condition for the instruction, maintaining (406) stateinformation for the instruction in the load/store slice (222 a) insteadof notifying an instruction sequencing unit of a rejection of theinstruction.

The method of FIG. 6 differs from the method of FIG. 4, however, in thatthe method of FIG. 5 further includes determining (602) if theinstruction (452) is a load or a store, where if the instruction (452)is a load, then providing (604), from the load/store access queue (224)to the load reorder queue (304), the instruction, and if the instruction(452) is a store, then providing (606), from the load/store access queue(224) to the store reorder queue (306).

Determining (602) if the instruction (452) is a load or a store may becarried out by the load/store slice (222 a) determining whether anopcode for the instruction (452) received from the instructionsequencing unit matches a load operation or a store operation.

Providing (604), from the load/store access queue (224) to the loadreorder queue (304), the instruction (452) may be carried out by theload/store access queue (224) propagating the instruction (452) throughMUX (228) along line (316) to the load reorder queue (304).

Providing (606), from the load/store access queue (224) to the storereorder queue (304), the instruction (452) may be carried out by theload/store access queue (224) propagating the instruction (452) throughMUX (228) along line (316) to the store reorder queue (306).

In this way, the load/store access queue (224) may route load and storeinstructions to corresponding queues for handling the instruction, whereboth the load reorder queue (304) and the store reorder queue (306)include entries that are configured to maintain information formaintaining instructions that are determined to be subject to rejectionconditions such that the maintained information may be used to reawakenand reissue the instructions pending resolution of one or more rejectionconditions.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

It will be understood from the foregoing description that modificationsand changes may be made in various embodiments of the present inventionwithout departing from its true spirit. The descriptions in thisspecification are for purposes of illustration only and are not to beconstrued in a limiting sense. The scope of the present invention islimited only by the language of the following claims.

What is claimed is:
 1. A method of operation of a multi-slice processor,the multi-slice processor including a plurality of execution slices anda plurality of load/store slices, the method comprising: receiving, at aload/store slice, an instruction to be issued; and responsive todetermining a rejection condition for the instruction, maintaining stateinformation for the instruction in the load/store slice.
 2. The methodof claim 1, further comprising: determining that the rejection conditionfor the instruction has resolved or is pending resolution; andresponsive to determining that the rejection condition for theinstruction has resolved or is pending resolution, reissuing theinstruction from within the load/store slice.
 3. The method of claim 2,further comprising: responsive to determining that the rejectioncondition for the instruction has resolved or is pending resolution,notifying an instruction sequencing unit that the instruction is beingreissued.
 4. The method of claim 2, wherein the instruction is a loadinstruction, and wherein the method further comprises: determining anarrival of data for the instruction from a lower tier of memory into adata cache on the load/store slice; and scheduling the instruction to beissued such that the instruction may provide the data for theinstruction to a destination without accessing the data cache.
 5. Themethod of claim 1, further comprising: determining that the rejectioncondition is expected to resolve within a quantity of cycles; andresponsive to determining that the rejection condition is expected toresolve within the quantity of cycles, scheduling the instruction to beissued coincident with a lapse of the quantity of cycles.
 6. The methodof claim 1, wherein the load/store slice comprises a load/store accessqueue and a load reorder queue, and wherein receiving the instruction tobe issued comprises: determining that the instruction is a loadinstruction; and providing, from the load/store access queue to the loadreorder queue, the instruction.
 7. The method of claim 1, wherein theload/store slice comprises a load/store access queue and a store reorderqueue, and wherein receiving the instruction to be issued comprises:determining that the instruction is a store instruction; and providing,from the load/store access queue to the store reorder queue, theinstruction.